Exponential Tail Bounds for Max-recursive Sequences
نویسنده
چکیده
Exponential tail bounds are derived for solutions of max-recursive equations and for maxrecursive random sequences, which typically arise as functionals of recursive structures, of random trees or in recursive algorithms. In particular they arise in the worst case analysis of divide and conquer algorithms, in parallel search algorithms or in the height of random tree models. For the proof we determine asymptotic bounds for the moments or for the Laplace transforms and apply a characterization of exponential tail bounds due to Kasahara (1978).
منابع مشابه
Exponential Bounds and Tails for Additive Random Recursive Sequences
Exponential bounds and tail estimates are derived for additive random recursive sequences, which typically arise as functionals of recursive structures, of random trees or in recursive algorithms. In particular they arise as parameters of divide and conquer type algorithms. We derive tail bounds from estimates of the Laplace transforms and of the moment sequences. For the proof we use some clas...
متن کاملBounds on the Tail Distributions of Markov-modulated Stochastic Max-plus Systems
In this paper we consider a particular class of linear systems under the max-plus algebra and derive exponential upper bounds for the tail distribution of each component of the state vector in the case of Markov modulated input sequences. Our results are then applied to tandem queues with innnite buuers, Markov modulated arrivals and deterministic service times.
متن کاملOn the Exponentiality of Stochastic Linear Systems under the Max-Plus Algebra
In this paper, we consider stochastic linear systems under the max-plus algebra. For such a system, the states are governed by the recursive equation X n = A n X n 1 U n with the initial condition X 0 = x 0 . By transforming the linear system under the max-plus algebra into a sublinear system under the usual algebra, we establish various exponential upper bounds for the tail distributions of th...
متن کاملAIOSC: Analytical Integer Word-length Optimization based on System Characteristics for Recursive Fixed-point LTI Systems
The integer word-length optimization known as range analysis (RA) of the fixed-point designs is a challenging problem in high level synthesis and optimization of linear-time-invariant (LTI) systems. The analysis has significant effects on the resource usage, accuracy and efficiency of the final implementation, as well as the optimization time. Conventional methods in recursive LTI systems suffe...
متن کاملSome Probability Inequalities for Quadratic Forms of Negatively Dependent Subgaussian Random Variables
In this paper, we obtain the upper exponential bounds for the tail probabilities of the quadratic forms for negatively dependent subgaussian random variables. In particular the law of iterated logarithm for quadratic forms of independent subgaussian random variables is generalized to the case of negatively dependent subgaussian random variables.
متن کامل